An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures

This paper considers the transmission of an infinite sequence messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at destination subject to fixed decoding delay. While capacity channel that introduces only bursts erasures has been known for more than fifteen years, recently, with either one burst or multiple arbitrary in any fixed-sized sliding window established. However, explicit codes shown achieve this admissible set parameters require large field size scales exponentially Recently, it there exist which quadratically constructions were specific combinations parameters. work describes rate-optimal construction all and delay